Path Coupling Using Stopping Times
نویسندگان
چکیده
We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics for independent sets in a hypergraph mixes rapidly as long as the maximum degree ∆ of a vertex and the minimum size m of an edge satisfy m ≥ 2∆+1. We also state results that the Glauber dynamics for proper q-colourings of a hypergraph mixes rapidly if m ≥ 4 and q > ∆, and if m = 3 and q ≥ 1.65∆. We give related results on the hardness of exact and approximate counting for both problems.
منابع مشابه
Stopping Times, Metrics and Approximate Counting
In this paper we examine the importance of the choice of metric in path coupling, and its relationship to stopping time analysis. We give strong evidence that stopping time analysis is no more powerful than standard path coupling. In particular, we prove a stronger theorem for path coupling with stopping times, using a metric which allows us to analyse a one-step path coupling. This approach pr...
متن کاملPath coupling using stopping times and counting independent sets and colorings in hypergraphs
We give a new method for analysing the mixing time of a Markov chain using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics for independent sets in a hypergraph mixes rapidly as long as the maximum degree ∆ of a vertex and the minimum size m of an edge satisfy m ≥ 2∆ + 1. We also show that the Glauber dynamics for proper q-c...
متن کاملPath Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs
We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics for independent sets in a hypergraph mixes rapidly as long as the maximum degree ∆ of a vertex and the minimum size m of an edge satisfy m ≥ 2∆+1. We also show that the Glauber dynamics for proper q-colourings of a hypergraph m...
متن کاملMetric Construction, Stopping Times and Path Coupling
In this paper we examine the importance of the choice of metric in path coupling, and the relationship of this to stopping time analysis. We give strong evidence that stopping time analysis is no more powerful than standard path coupling. In particular, we prove a stronger theorem for path coupling with stopping times, using a metric which allows us to restrict analysis to standard one-step pat...
متن کاملWeek 8 Stopping times, martingales, strategies
This definition makes sense without extra mathematical technicalities if Xt is a continuous function of t and S is a closed set. In that case, Xτ ∈ S and Xt / ∈ S if t < τ . Many practical problems may be formulated using hitting times. When does something break? How long does it take to travel a given distance? A hitting time is an important example of the more general idea of a stopping time....
متن کامل